Transparent partial order reduction
نویسندگان
چکیده
منابع مشابه
Transparent partial order reduction
Partial Order Reduction (POR) techniques improve the basic model checking algorithm by reducing the numbers of states and transitions explored in verifying a property of the model. In the “ample set” POR framework for the verification of an LTL−X formula φ, one associates to each state s a subset Ts of the set of all transitions enabled at s. The approach requires that whenever Ts is a proper s...
متن کاملTitle : Transparent Partial Order Reduction
Partial Order Reduction (POR) techniques improve the basic model checking algorithm by reducing the numbers of states and transitions explored in verifying a property of the model. In the “ample set” POR framework for the verification of an LTL −X formula φ, one associates to each state s a subset Ts of the set of all transitions enabled at s. The approach requires that whenever Ts is a proper ...
متن کاملStatic Partial Order Reduction
1 I n t r o d u c t i o n One c o m m o n me thod for dealing with the intrinsically intractable computa t iona l complexi ty of model-checking asynchronous systems is partial order reduction. This reduct ion technique exploits the c o m m o n practice of model ing concurrent events in asynchronous systems as an interleaving of the events in all possible execution orders. An impor t an t observ...
متن کاملCartesian Partial-Order Reduction
Verifying concurrent programs is challenging since the number of thread interleavings that need to be explored can be huge even for moderate programs. We present a cartesian semantics that reduces the amount of nondeterminism in concurrent programs by delaying unnecessary context switches. Using this semantics, we construct a novel dynamic partial-order reduction algorithm. The cartesian semant...
متن کاملApproximate Partial Order Reduction
We develop a partial order reduction method for labeled transition systems over metric spaces. We introduce the notion of ε-independent actions such that executing these actions in any order results in states that are close to each other. Then we define ε-equivalent action sequences that swap ε-independent action pairs. We present an algorithm to over-approximate the reach set of executions tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formal Methods in System Design
سال: 2011
ISSN: 0925-9856,1572-8102
DOI: 10.1007/s10703-011-0126-0